Quantitative μ-calculus and CTL defined over constraint semirings
نویسندگان
چکیده
منابع مشابه
Quantitative mu-calculus and CTL defined over constraint semirings
Model checking and temporal logics are boolean. The answer to the model checking question does a system satisfy a property? is either true or false, and properties expressed in temporal logics are defined over boolean propositions. While this classic approach is enough to specify and verify boolean temporal properties, it does not allow to reason about quantitative aspects of systems. Some quan...
متن کاملQuantitative ?-calculus and CTL Based on Constraint Semirings
Model checking and temporal logics are boolean. The answer to the model checking question does a system satisfy a property? is either true or false, and properties expressed in temporal logics are defined over boolean propositions. While this classic approach is enough to specify and verify boolean temporal properties, it does not allow to reason about quantitative aspects of systems. Some quan...
متن کاملConstraint Solving over Semirings
We introduce a general framework for constraint solving where classical CSPs, fuzzy CSPs, weighted CSPs, partial constraint satisfaction, and others can be easily cast. The framework is based on a semiring structure, where the set of the semiring specifies the values to be associated to each tuple of values of the variable domain, and the two semiring operations (+ and x) model constraint proje...
متن کاملThe Quantitative Μ-calculus Diplom-informatikerin
This thesis studies a generalisation of the modal μ-calculus, a modal fixedpoint logic that is an important specification language in formal verification. We define a quantitative generalisation of this logic, meaning that formulae do not just evaluate to true or false anymore but instead to arbitrary real values. First, this logic is evaluated on a quantitative extension of transition systems ...
متن کاملOn First-Order μ-Calculus over Situation Calculus Action Theories
In this paper we study verification of situation calculus action theories against first-order μ-calculus with quantification across situations. Specifically, we consider μLa and μLp, the two variants of μ-calculus introduced in the literature for verification of data-aware processes. The former requires that quantification ranges over objects in the current active domain, while the latter addit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.08.006